Hierarchical Meshes for Volume Data
نویسندگان
چکیده
An algorithm for adaptive refinement of 3D-meshes is outlined. This algorithm is very convenient for the generation of mesh hierarchies used for efficient volume visualization algorithms, e.g. iso-surface extraction or direct volume rendering, and for multilevel finite element computations. The aim was to construct an algorithm which generates as little congruence classes as possible. The main idea is to work with consistent partitions of the domain into tetrahedra and octahedra. The refinement consists of regular refinement rules which produce per element type one congruence class. In the case of local mesh refinement, for generating consistent subdivisions a temporary (virtual) closure is done based on suitable irregular refinement rules.
منابع مشابه
Pressure-Velocity Coupled Finite Volume Solution of Steady Incompressible Invscid Flow Using Artificial Compressibility Technique
Application of the computer simulation for solving the incompressible flow problems motivates developing efficient and accurate numerical models. The set of Inviscid Incompressible Euler equations can be applied for wide range of engineering applications. For the steady state problems, the equation of continuity can be simultaneously solved with the equations of motion in a coupled manner using...
متن کاملMultiresolution Interval Volume Meshes
Interval volumes are a generalization of isosurfaces that represent the set of points between two surfaces. In this paper, we present a compact multi-resolution representation for interval volume meshes extracted from regularly sampled volume data sets. The multi-resolution model is a hierarchical tetrahedral mesh whose updates are based on the longest edge bisection (LEB) subdivision strategy ...
متن کاملQuadtree and Octree Grid Generation
Engineering analysis often involves the accurate numerical solution of boundary value problems in discrete form. Hierarchical quadtree (or octree) grid generation offers an efficient method for the spatial discretisation of arbitrary-shaped two- (or three-) dimensional domains. It consists of recursive algebraic splitting of sub-domains into quadrants (or cubes), leading to an ordered hierarchi...
متن کاملMultiresolution Surface and Volume Representations
We present a wavelet-based geometry compression pipeline in the context of hierarchical surface and volume representations. Due to the increasing complexity of geometric models used in a vast number of different application fields, new methods have to be devised that enable one to store, transmit and manipulate large amounts of data. Based on a multiresolution wavelet representation, we have de...
متن کاملProgressive Iso-Surface Extraction from Hierarchical 3D Meshes
A multiresolution data decomposition offers a fundamental framework supporting compression, progressive transmission, and level-of-detail (LOD) control for large two or three dimensional data sets discretized on complex meshes. In this paper we extend a previously presented algorithm for 3D mesh reduction for volume data based on multilevel finite element approximations in two ways. First, we p...
متن کامل